3 research outputs found

    Information distribution and recharging dispatch strategy in large wireless networks

    Get PDF
    Large wireless networks are envisioned to play increasingly important roles as more and more mobile wireless devices and Internet of Things (IoT) devices are put in use. In these networks, it is often the case that some critical information needs to be readily accessible, requiring a careful design of the information distribution technique. In this work, we at first propose PeB, Periodic Broadcast, that takes advantage of periodic broadcast from the information server(s) to leave traces for nodes requesting for the information while maintaining a low overhead. Similar to swarm intelligence, PeB requires each node to keep track of traces, or past records of information flow, through itself toward information servers. We present our extensive investigation of the PeB scheme on cost and network dynamics as compared to other state-of-the-art techniques. When the devices run out of battery, they become static and need to be recharged by the wireless charging vehicles (WCVs). Often times, WCV receives a number of charging requests and form a Hamiltonian cycle and visit these nodes one-by-one. We also propose a heuristic algorithm, termed Quad, that generates a Hamiltonian cycle in a square plane. We then focus on the theoretical study of the length of the Hamiltonian cycles in such networks

    HQuad: Statistics of Hamiltonian Cycles in Wireless Rechargeable Sensor Networks

    No full text
    The rise of wireless rechargeable sensor networks calls for an analytical study of planned charging trips of wireless charging vehicles (WCVs). Often times, the WCV receives a number of charging requests and form a Hamiltonian cycle and visit these nodes one-by-one. Therefore, it is important to learn the statistics of such cycles. In this work, we use a heuristic algorithm, which we term HQuad, that takes O(N) to generate a Hamiltonian cycle in a 2-D network plane before we analyze its statistics. HQuad is based on a recursive approximation of dividing the region into four quadrants and the non-empty quadrants will be visited one-by-one. Our analysis is based on Poisson point distribution of nodes and models such Hamiltonian cycles surprisingly well in both expected values and the distribution functions of lengths as a function of different network parameters. Numerical results of our analysis model are compared with simulations and demonstrated to be accurate
    corecore